a = int(input())
for i in range(a):
l = list(input())
ans = 18
for i in range(len(l)):
for j in range(i+1, len(l)):
if l[i] == '0' and l[j] == '0':
ans = min(ans, len(l)-1-i)
elif l[i] == '2' and l[j] == '5':
ans = min(ans, len(l)-1-i)
elif l[i] == '5' and l[j] == '0':
ans = min(ans, len(l)-1-i)
elif l[i] == '7' and l[j] == '5':
ans = min(ans, len(l)-1-i)
print(ans-1)
#include <iostream>
#include<bits/stdc++.h>
using namespace std;
int main() {
// Write C++ code here
string str[]={"00","25","50","75"};
int t;
cin>>t;
string *s1=new string[t];
for(int k=0;k<t;k++)
cin>>s1[k];
int t1=t-1;
while(t--)
{
string s=s1[t1-t];
int ans=INT_MAX;
for(int j=0;j<4;j++)
{ int c=0,i;
for(i=s.length()-1;i>=0;i--)
{
if(s[i]!=str[j].at(1))
c++;
else{i--;
break;
}
}
for(;i>=0;i--)
{
if(s[i]!=str[j].at(0))
c++;
else break;
}
ans=c<ans?c:ans;
}
cout<<ans<<endl;
ans=INT_MAX;
}
}376A - Lever | 1305A - Kuroni and the Gifts |
1609A - Divide and Multiply | 149B - Martian Clock |
205A - Little Elephant and Rozdil | 1609B - William the Vigilant |
978B - File Name | 1426B - Symmetric Matrix |
732B - Cormen --- The Best Friend Of a Man | 1369A - FashionabLee |
1474B - Different Divisors | 1632B - Roof Construction |
388A - Fox and Box Accumulation | 451A - Game With Sticks |
768A - Oath of the Night's Watch | 156C - Cipher |
545D - Queue | 459B - Pashmak and Flowers |
1538A - Stone Game | 1454C - Sequence Transformation |
165B - Burning Midnight Oil | 17A - Noldbach problem |
1350A - Orac and Factors | 1373A - Donut Shops |
26A - Almost Prime | 1656E - Equal Tree Sums |
1656B - Subtract Operation | 1656A - Good Pairs |
1367A - Short Substrings | 87A - Trains |